Density Gain-Rate Peaks for Spectral Clustering
نویسندگان
چکیده
منابع مشابه
DFC: Density Fragment Clustering without Peaks
The density peaks clustering (DPC) algorithm is a novel density-based clustering approach. Outliers can be spotted and excluded automatically, and clusters can be found regardless of the shape and of dimensionality of the space in which they are embedded. However, it still has problems when processing a complex data set with irregular shapes and varying densities to get a good clustering result...
متن کاملDensity Peaks Clustering with Differential Privacy
Density peaks clustering (DPC) is a latest and well-known density-based clustering algorithm which offers advantages for finding clusters of arbitrary shapes compared to others algorithm. However, the attacker can deduce sensitive points from the known point when the cluster centers and sizes are exactly released in the cluster analysis. To the best of our knowledge, this is the first time that...
متن کاملClustering Sentences with Density Peaks for Multi-document Summarization
Multi-document Summarization (MDS) is of great value to many real world applications. Many scoring models are proposed to select appropriate sentences from documents to form the summary, in which the clustering-based methods are popular. In this work, we propose a unified sentence scoring model which measures representativeness and diversity at the same time. Experimental results on DUC04 demon...
متن کاملA Link Density Clustering Algorithm based on Automatically Selecting Density Peaks For Overlapping Community Detection
In this paper, we proposed a link density clustering method for overlapping community detection based on density peaks. We firstly use an extended cosine link distance metric to reflect the relationship of links. Then we introduce a clustering algorithm with fast search for solving the link clustering problem by density peaks with box plot strategy to determine the cluster centres automatically...
متن کاملExtended fast search clustering algorithm: widely density clusters, no density peaks
CFSFDP (clustering by fast search and find of density peaks) is recently developed density-based clustering algorithm. Compared to DBSCAN, it needs less parameters and is computationally cheap for its noniteration. Alex. at al have demonstrated its power by many applications. However, CFSFDP performs not well when there are more than one density peak for one cluster, what we name as "no density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3066498